On the degree of the polynomial defining a planar algebraic curves of constant width

نویسندگان

  • Magali Bardet
  • Térence Bayen
چکیده

In this paper, we consider a family of closed planar algebraic curves C which are given in parametrization form via a trigonometric polynomial p. When C is the boundary of a compact convex set, the polynomial p represents the support function of this set. Our aim is to examine properties of the degree of the defining polynomial of this family of curves in terms of the degree of p. Thanks to the theory of elimination, we compute the total degree and the partial degrees of this polynomial, and we solve in addition a question raised by Rabinowitz in [18] on the lowest degree polynomial whose graph is a non-circular curve of constant width. Computations of partial degrees of the defining polynomial of algebraic surfaces of constant width are also provided in the same way.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the M-polynomial of planar chemical graphs

Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

Computing real inflection points of cubic algebraic curves

Shape modeling using planar cubic algebraic curves calls for computing the real inflection points of these curves since inflection points represents important shape feature. A real inflection point is also required for transforming projectively a planar cubic algebraic curve to the normal form, in order to facilitate further analysis of the curve. However, the naive method for computing the inf...

متن کامل

On the complexity of computing with planar algebraic curves

In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials f , g ∈ Z[x, y] and an arbitrary polynomial h ∈ Z[x, y], each of total degree less than n and with integer coefficients of absolute value less than 2 , we show that each of the following problems can be solved in a deterministic ...

متن کامل

Improved Complexity Bounds for Computing with Planar Algebraic Curves

In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials f , g ∈ Z[x, y] and an arbitrary polynomial h ∈ Z[x, y], each of total degree less than n and with integer coefficients of absolute value less than 2 , we show that each of the following problems can be solved in a deterministic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1312.4358  شماره 

صفحات  -

تاریخ انتشار 2013